minimum vertex cover problem造句
例句與造句
- For graphs that are not bipartite, the maximum matching and minimum vertex cover problems are very different in complexity : maximum matchings can be found in polynomial time for any graph, while minimum vertex cover is NP-complete.
- It's difficult to find minimum vertex cover problem in a sentence. 用minimum vertex cover problem造句挺難的